Basis for binary comparisons and non-standard probabilities.
نویسنده
چکیده
To analyse paired comparison outcomes, such as with non-standard probabilities, a basis is created for the space of all binary interactions, whether from probabilities, correlations, etc. In this manner, the source of all transitive and non-transitive behaviours (e.g. path dependencies) can be identified.
منابع مشابه
Comparing groups in binary regression models using predictions∗
Methods for group comparisons using predicted probabilities and marginal effects on probabilities are developed for the binary regression model. Unlike standard tests that compare regression coefficients across groups, the tests we propose are unaffected by the identification of the coefficients and are expressed in the natural metric of the outcome probability. While we focus on the logit mode...
متن کاملNovel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection
In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...
متن کاملDigital Binary Phase-shift Keyed Signal Detector
We have developed the effective algorithm for detecting digital binary phase-shift keyed signals. This algorithm requires a small number of arithmetic operations over the signal period. It can be relatively easy implemented based on the modern programmable logic devices. It also provides high interference immunity by identifying signal presence when signal-to-noise ratio is much less that its w...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملTop-Down and Bottom-Up Tree Search Algorithms for Selecting Bases in Wavelet Packet Transforms
Search algorithms for finding signal decompositions called near-best bases using decision criteria called non-additive information costs have recently been proposed by Taswell [12] for selecting bases in wavelet packet transforms represented as binary trees. These methods are extended here to distinguish between top-down and bottom-up tree searches. Other new non-additive information cost funct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Philosophical transactions. Series A, Mathematical, physical, and engineering sciences
دوره 374 2058 شماره
صفحات -
تاریخ انتشار 2016